Completeness of Narrowing for Orthogonal Conditional Rewrite Systems
نویسنده
چکیده
Conditional narrowing is underlying computational mechanism of most functional-logic programming languages. It is important to ensure completeness of conditional narrowing for conditional term rewriting systems without assumption of termination because termination is a too severe restriction for programming languages. In this paper we show completeness of conditional narrowing for a kind of orthogonal, not necessarily terminating, conditional term rewriting systems with extra variables only in the conditions of their rewrite rules, so-called 2-CTRSs. The systems we are concerned with are the extension of orthogonal normal conditional term rewriting systems, which are the basis of most functional-logic languages. Therefore this result enables us to extend such programming languages.
منابع مشابه
Strong Completeness of a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus of Middeldorp, Okui, and Ida 13] to conditional rewrite systems. We show that our calculus is strongly complete whenever basic conditional narrowing is complete. This generalizes one of the three main results of 13] to the conditional case. As a corollary we obtain the strong completeness for three classes of conditional rewrite systems, one o...
متن کاملLevel-Con uence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-con uence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-con uence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand side...
متن کاملLevel-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-confluence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-confluence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand si...
متن کاملConditional Directed Narrowing
We extend the directed narrowing to the conditional framework, and prove soundness and completeness for two classes of conditional term rewrite systems : connuent and decreasing in one hand, level-connuent and terminating in the other hand. We show that conditional directed narrowing terminates more often than conditional basic narrowing. Then, we add LSE tests as constraints in our procedure, ...
متن کاملCompleteness Results for Basic Narrowing1
In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to normalizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of Hölldobler which states the complet...
متن کامل